package com.kaifamiao.month03.day0317;

public class Shop {

    public static void main(String[] args) {

        int capacity = 70;
        int[][] goods = {
                {12,5},
                {10,2}
        }; // 商品的占用空间和数量
        int[][] goodCapacity = new int[goods[0].length][];

        // 如果把商品全部摆完占用的空间
        int result = 0;
        for(int i = 0; i < goods.length; i ++){
            result += goods[i][0] * goods[i][1];
            // 商品1的位置数组
            for(int j = 0; j < goods[0][1]; j ++){
                goodCapacity[j][i] = goods[i][0] * goods[0][0];
                goodCapacity[j][i + 1] = j;
            }
            for(int j = 0; j < goods[1][1]; j ++){
                goodCapacity[j][i + 1] = goods[i][0] * goods[1][0];
                goodCapacity[j][i + 3] = j;
            }

        }
        System.out.println(result);


    }
}
